Lattices Related to Extensions of Presentations of Transversal Matroids
نویسنده
چکیده
For a presentation A of a transversal matroid M , we study the ordered set TA of single-element transversal extensions of M that have presentations that extend A; extensions are ordered by the weak order. We show that TA is a distributive lattice, and that each finite distributive lattice is isomorphic to TA for some presentation A of some transversal matroid M . We show that TA ∩ TB, for any two presentations A and B of M , is a sublattice of both TA and TB. We prove sharp upper bounds on |TA| for presentations A of rank less than r(M) in the order on presentations; we also give a sharp upper bound on |TA ∩ TB|. The main tool we introduce to study TA is the lattice LA of closed sets of a certain closure operator on the lattice of subsets of {1, 2, . . . , r(M)}.
منابع مشابه
Extensions and presentations of transversal matroids
A transversal matroid M can be represented by a collection of sets, called a presentation of M , whose partial transversals are the independent sets of M . Minimal presentations are those for which removing any element from any set gives a presentation of a different matroid. We study the connections between (single-element) transversal extensions of M and extensions of presentations of M . We ...
متن کاملAn Introduction to Transversal Matroids
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....
متن کاملGeometric lattice structure of covering-based rough sets through matroids
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role in covering reductions. In this paper, we construct four geometric lattice structures of covering-based rough sets through matroids, and compare their relatio...
متن کاملTransversal Lattices
A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way. A lattice is a Tr-lattice if all matroids whose lattices of cyclic flats are isomorphic to it are transversal. We investigate some sufficient conditions for a lattice to be a Tr-lattice; a corollary is that distributive lattices of ...
متن کاملGeometric lattice structure of covering and its application to attribute reduction through matroids
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially greedy algorithm design which plays an important role in the reduction problems. Therefore, it is meaningful to combine coverings with geometric lattices to sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017